Automatic Parallelization by Pattern-Matching

نویسندگان

  • Christoph W. Kessler
  • Wolfgang J. Paul
چکیده

We present the top{down design of a new system which performs automatic parallelization of numerical Fortran 77 or C source programs for execution on distributed{memory message { passing multi-processors such as e.g. the INTEL iPSC860 or the TMC CM{5. The key idea is a high{level pattern{matching approach which in some useful way permits partial restructuring of a wide class of numerical programs. With only a few hundred patterns, we will be able to completely match many important numerical algorithms. Together with mathematical background knowledge and parallel compiler engineering experience, this opens access to a new potential for automatic parallelization that has never been exploited before.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of a Potential for Automatic SIMD Parallelization of Embedded Applications

This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (pattern matching based) code transformation engine is used. The experiments show that about 85% of the loops which are suitable for Single Instruction Multiple Data (SIMD) parallelization can be automatically recognized and...

متن کامل

An Effective Algorithm for Computation of Two-Dimensional Fourier Transform for NxM Matrices

Invited Lecture: Foundations of Practical Parallel Programming Languages p. 115 Prototyping Parallel Algorithms with ProSet-Linda p. 135 Identifying the Available Parallelism Using Static Analysis p. 151 Automatic Parallelization by Pattern-Matching p. 166 Parallelization A Case Study p. 182 Invited Lecture: PVM 3 Beyond Network Computing p. 194 The Design of the PACLIB Kernel for Parallel Alge...

متن کامل

Automatic SIMD Parallelization of Embedded Applications Based on Pattern Recognition

This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (pattern matching based) code transformation engine is used, which involves a three-step process of matching, condition checking and replacing of the source code. Experiments with DSP and the MPEG2 encoder benchmarks, show t...

متن کامل

Improvement and parallelization of Snort network intrusion detection mechanism using graphics processing unit

Nowadays, Network Intrusion Detection Systems (NIDS) are widely used to provide full security on computer networks. IDS are categorized into two primary types, including signature-based systems and anomaly-based systems. The former is more commonly used than the latter due to its lower error rate. The core of a signature-based IDS is the pattern matching. This process is inherently a computatio...

متن کامل

The LRPD Test: Speculative Run–Time Parallelization of Loops with Privatization and Reduction Parallelization

Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we advocate a novel framework for their identification: speculatively execute the loop as a doall, and apply a fully parallel data dependence test to determine if it ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993